Foundations of Exact Rounding
نویسندگان
چکیده
Exact rounding of numbers and functions is a fundamental computational problem. This paper introduces the mathematical and computational foundations for exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.
منابع مشابه
Exact 3-D Solution for Free Bending Vibration of Thick FG Plates and Homogeneous Plate Coated by a Single FG Layer on Elastic Foundations
This paper presents new exact 3-D (three-dimensional) elasticity closed-form solutions for out-of-plane free vibration of thick rectangular single layered FG (functionally graded) plates and thick rectangular homogeneous plate coated by a functionally graded layer with simply supported boundary conditions. It is assumed that the plate is on a Winkler-Pasternak elastic foundation and elasticity ...
متن کاملThe Generic Multiple-Precision Floating-Point Addition With Exact Rounding (as in the MPFR Library)
We study the multiple-precision addition of two positive floating-point numbers in base 2, with exact rounding, as specified in the MPFR library, i.e. where each number has its own precision. We show how the best possible complexity (up to a constant factor that depends on the implementation) can be obtain.
متن کاملShortest Path Geometric
Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signiicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accura...
متن کاملPractical methods for set operations on polygons using exact arithmetic
We present here numerical and combinatorial methods that permit the use of exact arithmetic in the construction of unions and intersection of polygonal regions. An argument is given that, even in an exact arithmetic system , rounding of coordinates is necessary. We also argue that it is natural and useful to round to a nonuniform grid, and we give methods for calculating the nearest grid point....
متن کاملAlan Turing and the other theory of computation (expanded)
We recognize Alan Turing’s work in the foundations of numerical computation (in particular, his 1948 paper “Rounding-Off Errors in Matrix Processes”), its influence in modern complexity theory, and how it helps provide a unifying concept for the two major traditions of the theory of computation.
متن کامل